Trees with Equal Restrained Domination and Total Restrained Domination Numbers
نویسندگان
چکیده
For a graph G = (V,E), a set D ⊆ V (G) is a total restrained dominating set if it is a dominating set and both 〈D〉 and 〈V (G)−D〉 do not have isolated vertices. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number. A set D ⊆ V (G) is a restrained dominating set if it is a dominating set and 〈V (G) − D〉 does not contain an isolated vertex. The cardinality of a minimum restrained dominating set in G is the restrained domination number. We characterize all trees for which total restrained and restrained domination numbers are equal.
منابع مشابه
Trees with Equal Total Domination and Total Restrained Domination Numbers
For a graph G = (V, E), a set S ⊆ V (G) is a total dominating set if it is dominating and both 〈S〉 has no isolated vertices. The cardinality of a minimum total dominating set in G is the total domination number. A set S ⊆ V (G) is a total restrained dominating set if it is total dominating and 〈V (G) − S〉 has no isolated vertices. The cardinality of a minimum total restrained dominating set in ...
متن کاملTotal restrained domination numbers of trees
For a given connected graphG= (V ,E), a setDtr ⊆ V (G) is a total restrained dominating set if it is dominating and both 〈Dtr〉 and 〈V (G)−Dtr〉 do not contain isolate vertices. The cardinality of the minimum total restrained dominating set in G is the total restrained domination number and is denoted by tr(G). In this paper we characterize the trees with equal total and total restrained dominati...
متن کاملOn Roman, Global and Restrained Domination in Graphs
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination number is equal to the domination num...
متن کاملResults on Total Domination and Total Restrained Domination in Grid Graphs
A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex v ∈ V is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total restrained dominating set if every vertex v ∈ V is adjacent to an element of S and every vertex of V − S is adjacent to a vertex in V − S. The total domination number of a graph G denoted by γt(G) is the minimum card...
متن کاملOn the total restrained domination edge critical graphs
Let G = (V, E) be a graph. A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V −D has a neighbor in V −D. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number of G. In this paper, we define the concept of total restrained domination edge critical graphs, find a lower bound for...
متن کامل